منابع مشابه
An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks
We present an efficient parallel algorithm for scheduling n unit length tasks on m identical processors when the precedence graphs are interval orders. Our algorithm requires O(log v + (n logn)/v) time and O(nv + n) operations on the CREW PRAM, where v ≤ n is a parameter. By choosing v = √ n, we obtain an O( √ n logn)-time algorithm with O(n) operations. For v = n/ logn, we have an O(log n)time...
متن کاملScheduling Interval Ordered Tasks with Non-Uniform Deadlines
Garey and Johnson defined an algorithm that finds minimum-lateness schedules for arbitrary graphs with unit-length tasks on two processors. Their algorithm can be easily generalised to an algorithm that constructs minimumlateness schedules for interval orders on m processors. In this paper, we study the problem of scheduling interval orders with deadlines without neglecting the communication co...
متن کاملScheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
We study the problem of scheduling unit-length interval-ordered tasks subject to unit-length communication delays with the objective of minimising the maximum tardiness. Without communication delays, this problem can be solved by a generalisation of an algorithm presented by Garey and Johnson. In this paper, an algorithm is presented that considers unit-length communication delays and construct...
متن کاملOrdered Interval Routing
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is called a k-IRS. In this thesis, we propose a new type of interval routing scheme, called an Ordered In...
متن کاملInterval ordered information systems
Interval information systems are generalizedmodels of single-valued information systems. By introducing a dominance relation to interval information systems, we propose a ranking approach for all objects based on dominance classes and establish a dominance-based rough set approach, which is mainly based on substitution of the indiscernibility relation by the dominance relation. Furthermore, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1979
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0208031